Toric Codes, Multiplicative Structure and Decoding

نویسنده

  • Johan P. Hansen
چکیده

Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for decoding, resembling the decoding of Reed-Solomon codes and aligns with decoding by error correcting pairs. We have used the multiplicative structure on toric codes to construct linear secret sharing schemes with strong multiplication via Massey’s construction generalizing the Shamir Linear secret sharing shemes constructed from Reed-Solomon codes. We have constructed quantum error correcting codes from toric surfaces by the Calderbank-Shor-Steane method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bringing Toric Codes to the next dimension

This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in R . We show that the minimum distance is multiplicative with respect to taking the product of polytopes, and behaves in a simple way when one builds a k -dilate of a pyramid over a polytope. This allows us to construct a large class of examples of higher dimensional t...

متن کامل

New constructions of CSS codes obtained by moving to higher alphabets

We generalize a construction of non-binary quantum LDPC codes over F2m due to [KHIK11] and apply it in particular to toric codes. We obtain in this way not only codes with better rates than toric codes but also improve dramatically the performance of standard iterative decoding. Moreover, the new codes obtained in this fashion inherit the distance properties of the underlying toric codes and ha...

متن کامل

Decoding color codes by projection onto surface codes

We propose a new strategy to decode color codes, which is based on the projection of the error onto three surface codes. This provides a method to transform every decoding algorithm of surface codes into a decoding algorithm of color codes. Applying this idea to a family of hexagonal color codes, with the perfect matching decoding algorithm for the three corresponding surface codes, we find a p...

متن کامل

A Simple Decoder for Topological Codes

Here we study an efficient algorithm for decoding topological codes. It is a simple form of HDRG decoder, which could be straightforwardly generalized to complex decoding problems. Specific results are obtained for the planar code with both i.i.d. and spatially correlated errors. The method is shown to compare well with existing ones, despite its simplicity.

متن کامل

Optimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling

This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1702.06569  شماره 

صفحات  -

تاریخ انتشار 2017